A flexible mixed integer programming-based system for real-world nurse rostering
نویسندگان
چکیده
Researchers have studied the nurse rostering problem for multiple decades. Initially, formulations were rather primitive including only a few necessary restrictions, but down road, become more complex. Nonetheless, fraction of research reaches implementation in practice, and many wards still schedule nurses manually. In this article, we introduce flexible system that employs mathematical optimization to automatically shifts. We developed collaboration with practitioners fully match their needs. The consists comprehensive mixed integer programming (MIP) model along framework. addition common constraints from literature, formulation includes three new further encourage healthy work schedules each nurse. Additionally, reformulated some literature allow complex shift structure matches needs real hospital wards. This flexibility results increased adaptability different is crucial address face. successfully implemented two at Danish hospitals. present MIP computational 12 real-world instances. Furthermore, discuss practical impact provide general feedback using it. Overall, illustrate capabilities tackle diverse instances produce outstanding results.
منابع مشابه
An Integer Programming-Based Nurse Rostering System
This paper considers a real-world rostering problem at the Gold Coast Hospital, Queensland. Nurse rostering is a constraint satisfaction problem (CSP) [3]. The task is to find a consistent allocation of shift values, for a group of nurses, over a fixed period of time, that satisfy a set of rostering constraints. These constraints include i) acceptable shift combinations (or schedules) for indiv...
متن کاملA Flexible Mixed Integer Programming framework for Nurse Scheduling
In this paper, a nurse-scheduling model is developed using mixed integer programming model. It is deployed to a general care ward to replace and automate the current manual approach for scheduling. The developed model differs from other similar studies in that it optimizes both hospital’s requirement as well as nurse preferences by allowing flexibility in the transfer of nurses from different d...
متن کاملNurse Rostering and Integer Programming Revisited
Design and development of robust and reliable scheduling algorithms has been an active research area in Computer Science and Artificial Intelligence. Given that the general problem is computationally intractable, many heuristic-based techniques have been developed, while other approaches have used optimising techniques for specific and limited problem domains. In this paper, we consider a large...
متن کاملInteger programming techniques for the nurse rostering problem
This work presents Integer Programming (IP) techniques to tackle the problem of the International Nurse Rostering Competition. Starting from a compact and monolithic formulation in which the current generation of solvers performs poorly, improved cut generation strategies and primal heuristics are proposed and evaluated. A large number of computational experiments with these techniques produced...
متن کاملA Hybrid Approach for Solving Real-World Nurse Rostering Problems
Nurse rostering is the process of creating a plan for nurse working hours over a given time horizon. This problem, most variants of which are NP-hard, has been studied extensively for many years. Still, practical nurse rostering is mostly done manually, often by highly qualified health care personnel. This underlines the need to address the challenges of realistic, applied nurse rostering, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2021
ISSN: ['1099-1425', '1094-6136']
DOI: https://doi.org/10.1007/s10951-021-00705-7